Description: 遗传算法中的基本算法 ，用C语言源代码实现，希望对大家 有帮助！-Genetic algorithm in the basic algorithm, using C-language source code to achieve, and they hope to have everyone help! Platform: |
Size: 5120 |
Author:xiankong |
Hits:
Description: 遗传算法中的 自适应算法，用C语言实现，源代码，希望对大家有帮助-Genetic algorithm in adaptive algorithm, using C language, source code, in the hope that everyone has to help Platform: |
Size: 9216 |
Author:xiankong |
Hits:
Description: 遗传算法是近来较为热门的结构优化方法,C源代码-Genetic algorithm is more popular in recent structural optimization methods, C source code Platform: |
Size: 3072 |
Author:郝晓 |
Hits:
Description: 用C#编写的利用遗传算法解决0-1背包问题的源程序，希望对需要的朋友有所帮助-C# prepared with the use of genetic algorithm to solve the 0-1 knapsack problem source, and they hope to help a friend in need Platform: |
Size: 25600 |
Author:mimi |
Hits:
Description: 这是一个非常简单的遗传算法源代码，是由Denis Cormier (North Carolina State University)开发的，Sita S.Raghavan (University of North Carolina at Charlotte)修正。代码保证尽可能少，实际上也不必查错。对一特定的应用修正此代码，用户只需改变常数的定义并且定义“评价函数”即可。注意代码 的设计是求最大值，其中的目标函数只能取正值；且函数值和个体的适应值之间没有区别。该系统使用比率选择、精华模型、单点杂交和均匀变异。如果用 Gaussian变异替换均匀变异，可能得到更好的效果。代码没有任何图形，甚至也没有屏幕输出，主要是保证在平台之间的高可移植性。读者可以从ftp.uncc.edu, 目录 coe/evol中的文件prog.c中获得。要求输入的文件应该命名为‘gadata.txt’；系统产生的输出文件为‘galog.txt’。输入的 文件由几行组成：数目对应于变量数。且每一行提供次序——对应于变量的上下界。如第一行为第一个变量提供上下界，第二行为第二个变量提供上下界，等等。 -This is a very simple genetic algorithm is Denis Cormier source of Carolina re (State) development, Sita leads S.R aghavan (of Carolina at leads, where re. Code that is actually less as far as possible, don t find fault. For a particular application of this code, the user need revision of the constant change and define "evaluation function definition of". Note the design code for maximum, which is the objective function can take positive, And the function of the individual value and no difference between fitness. This system USES ratio, essence model, single hybridization and uniform variation. If use uniform variation and variation of Gaussian replacement may get better effect. Code without any graphics, nor even screen output, mainly is the guarantee of the platform between high portability. Readers can from the FTP uncc. J, directory coe/evol edu files in prog. C. The documents required input should be named "j" rather gadata System to produce output file for galog. J TXT Input f Platform: |
Size: 8192 |
Author:hua gong |
Hits:
Description: 用遗传算法解决8皇后问题，并在VC++环境下调试通过，得出了正确结果，word文档说明和C源代码-With a genetic algorithm to solve 8 queens problem, and in the VC++ debugging environment through, come to the right result, word and the C source code documentation Platform: |
Size: 20480 |
Author:paradise |
Hits:
Description: 采用遗传算法实现旅行商问题的C++源代码。-Traveling salesman problem using genetic algorithm in C++ source code. Platform: |
Size: 416768 |
Author:王利梅 |
Hits:
Description: 电网重构的C++源码，采用遗传算法进行求解开关组合的最优方案-Network Reconfiguration in C++ source code, using a combination of genetic algorithm to solve the optimal switching scheme Platform: |
Size: 6144 |
Author:zy |
Hits:
Description: The source code in C / C + + a program that implements a real-coded genetic algorithm, using any technique of crossing and mutation. The source code comments tenerv enough to do f acilmente understandable and should be included on a CD where deber a tambi en go the corresponding executable and all the runs you have made. The selection t ecnica and parameters in general are using their free choice, but must be clearly mentioned in the comments of the program and the corresponding report. It should mention what platform you tested the program (including the C / C + + used). Platform: |
Size: 6144 |
Author:ivan |
Hits:
Description: 遗传算法应用程序使用说明：
1.安装MATLAB5.X；
2.建立目录：(c:\GeneticProgram),并将这里提供的所有源程序拷入该目录；
3.运行(c:\GeneticProgram)中的 startup；
4.在MATLAB Command Window内直接运行程序 FloatExample和BinaryExample。
FloatExample和BinaryExample分别采用浮点编码和二进制编码方法，求函数
y=20+x + 10*sin(4*x)+8*cos(3*x) 在[0 10]区间内的最大值。
-The genetic algorithm application for use:
An installation MATLAB5.X
(2) create the directory: (c: \ GeneticProgram) copyed into that directory and all the source code here
3 run (c: in \ GeneticProgram), the startup
4 directly in the MATLAB Command Window to run program FloatExample and BinaryExample.
The FloatExample, and BinaryExample floating-point coding and binary coding method, demand function
y = 20+ x+ 10* sin (4* x)+8* cos (3* x) the maximum value in the interval [010]. Platform: |
Size: 17408 |
Author:liyapei |
Hits:
Description: 遗传和免疫算法源程序C语言，希望对大家有用Genetic and immune algorithm source code in C-Genetic and immune algorithm source code in C Platform: |
Size: 118784 |
Author:shang |
Hits:
Description: 详述了实现遗传算法在图像分割上的应用的一种新方法。为了减少编写遗传算法代码的复杂度, 提高程序的运行效率,
结合VC+ + 和MATLAB各自的优势, 采用混合编程的方法, 先用MATLAB 编写实现图像分割的遗传算法代码, 并设置特定参数代
码, 接着通过M a tcom 把此代码翻译成VC + + 能处理的C + + 源码, 最后通过VC + + 编译成一个可执行文件-Detailed genetic algorithm to achieve image segmentation on the application of a new method. Write the code in order to reduce the complexity of genetic algorithm to improve the efficiency of the program, combined with VC++ and MATLAB respective advantages, the use of hybrid programming method, first using MATLAB genetic algorithm for image segmentation code, and set a specific parameter code, then By M a tcom put this code translated into VC++ can handle C++ source, and finally through VC++ compiled into an executable file Platform: |
Size: 353280 |
Author:renxiaoqian |
Hits:
Description: 假设在一个供求关系系统中，车辆从货源取货，配送到对应的若干配送点。车辆存在最大载货量，且配送可能有时间限制。需要合理安排取货时间，组织适当的行车路线，使用户需求得到满足，同时使某个代价函数最小，比如总工作时间最少、路径最短等。
可以看出TSP问题是VRP问题的一种简单特殊形式。因此，VRP也是一种NP hard 问题。
目前解决此种问题的办法有多种，主要以启发式算法为主。包括退火算法、遗传算法、蚁群算法、禁忌算法等，本文介绍两种比较简单算法：C-W节约算法和遗传算法。(Assume that in a supply and demand relationship system, the vehicle picks up the goods from the source and delivers them to the corresponding distribution points. There is a maximum amount of cargo in the vehicle and there may be a time limit for delivery. It is necessary to arrange the picking time reasonably, organize the appropriate driving route, and satisfy the user's needs, and at the same time minimize a certain cost function, such as the minimum total working time and the shortest path.
It can be seen that the TSP problem is a simple and special form of the VRP problem. Therefore, VRP is also an NP hard problem.
At present, there are many ways to solve this kind of problem, mainly based on heuristic algorithms. Including annealing algorithm, genetic algorithm, ant colony algorithm, tabu algorithm, etc. This paper introduces two simple algorithms: C-W saving algorithm and genetic algorithm.) Platform: |
Size: 4096 |
Author:HappyppaH |
Hits:
Search - genetic algorithm source in c